package com.person.leetcode.editor.cn;

import java.util.List;

/**
  * 658.找到 K 个最接近的元素
  * 2022-08-25 16:59:09
**/
public class Sequence_0658_FindKClosestElements {
    public static void main(String[] args) {
        Solution solution = new Sequence_0658_FindKClosestElements().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public List<Integer> findClosestElements(int[] arr, int k, int x) {
        return null;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}